Pushdown automata with reversal-bounded counters
نویسندگان
چکیده
منابع مشابه
Pushdown Automata with Reversal-Bounded Counters
The main result of this paper is that a pushdown automaton M augmented with R(n) reversal-bounded counters can be simulated by a Turing machine in time polynomial in n”’ + R(n) if M is 2-way, and in time polynomial in n + R(n) if M is l-way. It follows from this and previous results that for sufficiently large R(n), the addition of a pushdown store to R(n) reversal-bounded multicounter machines...
متن کاملBounded-oscillation Pushdown Automata
We present an underapproximation for context-free languages by filtering out runs of the underlying pushdown automaton depending on how the stack height evolves over time. In particular, we assign to each run a number quantifying the oscillating behavior of the stack along the run. We study languages accepted by pushdown automata restricted to k-oscillating runs. We relate oscillation on pushdo...
متن کاملSynchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters
We study a class of concurrent pushdown automata communicating by both global synchronisations and reversal-bounded counters, providing a natural model for multithreaded programs with procedure calls and numeric data types. We show that the synchronisation-bounded reachability problem can be efficiently reduced to the satisfaction of an existential Presburger formula. Hence, the problem is NP-c...
متن کاملPushdown Automata
Families of Languages AFL thm if F is closed under substitution with λ-free regular sets, morphism, union with regular sets [easy for cfg] & intersection with regular sets, then F is closed under inverse morphism Figure 26: closure properties of CF II 12 intersection with regular languages a;A/α a a;A/α λ;A/α λ;A/α { } } { ⇒ ⇒ { anbn | n ≥ 1 }∗ ∩ { w ∈ {a, b}∗ |#ax even } r1 p1 q1 r0 p0 q0 r p ...
متن کاملScope-Bounded Pushdown Languages
We study the formal language theory of multistack pushdown automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa). We show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa). We prove the equivalence of the deterministic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90008-6